全文获取类型
收费全文 | 5052篇 |
免费 | 420篇 |
国内免费 | 327篇 |
专业分类
化学 | 274篇 |
晶体学 | 2篇 |
力学 | 25篇 |
综合类 | 139篇 |
数学 | 5116篇 |
物理学 | 243篇 |
出版年
2024年 | 10篇 |
2023年 | 100篇 |
2022年 | 138篇 |
2021年 | 120篇 |
2020年 | 199篇 |
2019年 | 227篇 |
2018年 | 215篇 |
2017年 | 198篇 |
2016年 | 123篇 |
2015年 | 90篇 |
2014年 | 174篇 |
2013年 | 451篇 |
2012年 | 191篇 |
2011年 | 295篇 |
2010年 | 299篇 |
2009年 | 436篇 |
2008年 | 378篇 |
2007年 | 274篇 |
2006年 | 316篇 |
2005年 | 216篇 |
2004年 | 199篇 |
2003年 | 173篇 |
2002年 | 164篇 |
2001年 | 147篇 |
2000年 | 105篇 |
1999年 | 95篇 |
1998年 | 89篇 |
1997年 | 64篇 |
1996年 | 47篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 28篇 |
1992年 | 25篇 |
1991年 | 15篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有5799条查询结果,搜索用时 15 毫秒
101.
《Discrete Mathematics》2019,342(4):1186-1190
102.
Andrey A. Dobrynin 《Discrete Mathematics》2019,342(1):74-77
Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph . The transmission of a vertex is the sum of distances from to all the other vertices of . If transmissions of all vertices are mutually distinct, then is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed. 相似文献
103.
104.
《Discrete Mathematics》2019,342(7):1956-1965
105.
Michael Tait 《Discrete Mathematics》2019,342(10):2843-2845
A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains many Fano subplanes. The number of planes of order less than previously known to contain a Fano subplane was , whereas the number of planes of order less than that our theorem applies to is not bounded above by any polynomial in . 相似文献
106.
《Discrete Mathematics》2019,342(5):1361-1377
Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical , are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are -regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries. 相似文献
107.
《Discrete Mathematics》2019,342(3):623-627
Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1]. 相似文献
108.
《Discrete Mathematics》2019,342(10):2846-2849
109.
Given a graph we are interested in studying the symmetric matrices associated to with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees. 相似文献
110.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献